Characterisation of hollow Russian doll microspheres

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Specializing Russian Doll Search

Russian Doll Search (RDS) is a clever procedure to solve overconstrained problems. RDS solves a sequence of nested subprob-lems, where two consecutive subproblems diier in one variable only. We present the Specialized RDS (SRDS) algorithm, which solves the current subproblem for each value of the new variable with respect to the previous subproblem. The SRDS lower bound is superior to the RDS l...

متن کامل

Multi-Objective Russian Doll Search

Russian Doll Search (RDS) is a well-known algorithm for combinatorial optimization. In this paper we extend it from mono-objective to multi-objective optimization. We demonstrate its practical applicability in the challenging multipleorbit SPOT5 instances. Besides being much more efficient than any other alternatives, multi-objective RDS can solve an instance which could not have been solved pr...

متن کامل

Integrability of the russian doll BCS model

We show that integrability of the BCS model extends beyond Richardson's model (where all Cooper pair scatterings have equal coupling) to that of the russian doll BCS model for which the couplings have a particular phase dependence that breaks time-reversal symmetry. This model is shown to be integrable using the quantum inverse scattering method, and the exact solution is obtained by means of t...

متن کامل

Russian Doll Search with Tree Decomposition

Optimization in graphical models is an important problem which has been studied in many AI frameworks such as weighted CSP, maximum satisfiability or probabilistic networks. By identifying conditionally independent subproblems, which are solved independently and whose optimum is cached, recent Branch and Bound algorithms offer better asymptotic time complexity. But the locality of bounds induce...

متن کامل

Search Space Reduction and Russian Doll Search

In a constraint optimization problem (COP), many feasible valuations lead to the same objective value. This often means a huge search space and poor performance in the propagation between the objective and problem variables. In this paper, we propose a different modeling and search strategy which focuses on the cost function. We show that by constructing a dual model on the objective variables,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Materials Science

سال: 2010

ISSN: 0022-2461,1573-4803

DOI: 10.1007/s10853-010-4479-3